The Five-Card Trick Can Be Done with Four Cards

نویسندگان

  • Takaaki Mizuki
  • Michihito Kumamoto
  • Hideaki Sone
چکیده

The “five-card trick” invented by Boer allows Alice and Bob to securely compute the AND function of their secret inputs using five cards—three black cards and two red cards—with identical backs. This paper shows that such a secure computation can be done with only four cards. Specifically, we give a protocol to achieve a secure computation of AND using only four cards—two black and two red. Our protocol is optimal in the sense that the number of required cards is minimum.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Card-Based Cryptographic Protocols Using a Minimal Number of Cards

Secure multiparty computation can be done with a deck of playing cards. For example, den Boer (EUROCRYPT ’89) devised his famous “five-card trick”, which is a secure two-party AND protocol using five cards. However, the output of the protocol is revealed in the process and it is therefore not suitable for general circuits with hidden intermediate results. To overcome this limitation, protocols ...

متن کامل

Card-based protocols for securely computing the conjunction of multiple variables

Consider a deck of real cards with faces that are either black or red and backs that are all identical. Then, using two cards of different colors, we can commit a secret bit to a pair of face-down cards so that its order (i.e., black to red, or red to black) represents the value of the bit. Given such two commitments (consisting of four face-down cards in total) together with one additional bla...

متن کامل

The Minimum Number of Cards in Practical Card-based Protocols

The elegant “five-card trick” of den Boer (EUROCRYPT 1989) allows two players to securely compute a logical AND of two private bits, using five playing cards of symbols ♥ and ♣. Since then, card-based protocols have been successfully put to use in classroom environments, vividly illustrating secure multiparty computation – and evoked research on the minimum number of cards needed for several fu...

متن کامل

Two-Person Symmetric Whist

The game of two-person whist is played with a deck of cards. Each card belongs to a suit, and each suit is totally ordered. The cards are distributed between the two players so that each player receives the same number of cards. Hence both players have complete information about the deal. Play proceeds in tricks, with the obligation to follow suit, as in many real-world card games. We study the...

متن کامل

On the Mathematical Background of Gilbreath's Card Trick

In Martin Gardner's book \New mathematical diversions from Scientiic American" it is described how certain information concerning the initial distribution of a deck of cards survives an arbitrarily thorough riie shuue. This gives rise to a card trick which is attributed to Norman Gilbreath, several other tricks presented in magic journals are based on the same principle. Here we aim to generali...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012